Matching theory

Results: 1366



#Item
31Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France

Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 05:27:10
32On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: +

On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: +

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:16:02
33doi:j.ins

doi:j.ins

Add to Reading List

Source URL: pbil.univ-lyon1.fr

Language: English - Date: 2008-10-22 02:35:21
34Online Matching: Haste makes Waste! (Full Version)∗ Yuval Emek† Shay Kutten‡

Online Matching: Haste makes Waste! (Full Version)∗ Yuval Emek† Shay Kutten‡

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2016-06-22 05:23:03
35Bipartizing fullerenes∗ Zdenˇek Dvoˇra´k† Bernard Lidick´ y‡

Bipartizing fullerenes∗ Zdenˇek Dvoˇra´k† Bernard Lidick´ y‡

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:44:55
366 base types types patterns matching clause seq. constants

6 base types types patterns matching clause seq. constants

Add to Reading List

Source URL: www.cs.bu.edu

Language: English - Date: 2009-12-10 13:53:23
37✐  ✐ ✐ “BN11N26” —  — 16:50 — page 401 — #1

✐ ✐ ✐ “BN11N26” — — 16:50 — page 401 — #1

Add to Reading List

Source URL: w3.math.sinica.edu.tw

Language: English - Date: 2016-06-06 22:30:40
38Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs Michael R. Fellows1 , Guillaume Fertin2 , Danny Hermelin?3 , and St´ephane Vialette4 1  School of Electrical Engineering and Computer

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs Michael R. Fellows1 , Guillaume Fertin2 , Danny Hermelin?3 , and St´ephane Vialette4 1 School of Electrical Engineering and Computer

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 12:10:56
39Locality in Networks Jukka Suomela Helsinki Institute for Information Technology HIIT Department of Computer Science, University of Helsinki Foundations of Network Science Workshop Riga, 7 July 2013

Locality in Networks Jukka Suomela Helsinki Institute for Information Technology HIIT Department of Computer Science, University of Helsinki Foundations of Network Science Workshop Riga, 7 July 2013

Add to Reading List

Source URL: users.ics.aalto.fi

Language: English - Date: 2013-12-09 16:38:32
40Algorithms and Data Structures Winter TermExercises for Units 37 & 38 1. For stable matching with incomplete lists, each man x ∈ X has a strict list x over a subset of the women Y, i.e., x is possibly incomp

Algorithms and Data Structures Winter TermExercises for Units 37 & 38 1. For stable matching with incomplete lists, each man x ∈ X has a strict list x over a subset of the women Y, i.e., x is possibly incomp

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-30 16:37:02